package hotLeetcode;

import java.util.Arrays;

public class H215Leetcode {
    public static int findKthLargest(int[] nums, int k) {

        Arrays.sort(nums);

        return nums[nums.length - k];

    }

    public static void main(String[] args) {
        int[] nums = new int[]{3,2,3,1,2,4,5,5,6};
        int k = 4;
        System.out.println(H215Leetcode.findKthLargest(nums, k));
    }
}
